diff --git a/packages/diff-sequences/build/index.js b/packages/diff-sequences/build/index.js
index a85f0a1ed..7c696426a 100644
--- a/packages/diff-sequences/build/index.js
+++ b/packages/diff-sequences/build/index.js
@@ -11,7 +11,6 @@ exports.default = void 0;
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- *
  */
 // This diff-sequences package implements the linear space variation in
 // An O(ND) Difference Algorithm and Its Variations by Eugene W. Myers
@@ -603,13 +602,33 @@ const findSubsequences = (
     if (transposed && callbacks.length === 1) {
       // Lazily wrap callback functions to swap args if graph is transposed.
       const _callbacks$ = callbacks[0],
-        _foundSubsequence = _callbacks$.foundSubsequence,
-        _isCommon = _callbacks$.isCommon;
+        foundSubsequence = _callbacks$.foundSubsequence,
+        isCommon = _callbacks$.isCommon;
       callbacks[1] = {
-        foundSubsequence: (nCommon, bCommon, aCommon) => {
-          _foundSubsequence(nCommon, aCommon, bCommon);
-        },
-        isCommon: (bIndex, aIndex) => _isCommon(aIndex, bIndex)
+        foundSubsequence: (function(_foundSubsequence) {
+          function foundSubsequence(_x, _x2, _x3) {
+            return _foundSubsequence.apply(this, arguments);
+          }
+
+          foundSubsequence.toString = function() {
+            return _foundSubsequence.toString();
+          };
+
+          return foundSubsequence;
+        })((nCommon, bCommon, aCommon) => {
+          foundSubsequence(nCommon, aCommon, bCommon);
+        }),
+        isCommon: (function(_isCommon) {
+          function isCommon(_x4, _x5) {
+            return _isCommon.apply(this, arguments);
+          }
+
+          isCommon.toString = function() {
+            return _isCommon.toString();
+          };
+
+          return isCommon;
+        })((bIndex, aIndex) => isCommon(aIndex, bIndex))
       };
     }